Proving Liveness Property under Strengthened Compassion Requirements
نویسندگان
چکیده
Deductive rules are useful for proving properties with fairness constraints and there have been many studies on such rules with justice and compassion constraints. This paper focuses on system specifications with strengthened compassion that impose constraints on transitions involving states and their successors. A deductive rule for proving liveness properties under strengthened compassion is presented with examples illustrating the application of the rule.
منابع مشابه
Proving Liveness Property under a Mixture of Strengthened Compassion and Compassion Requirements†
Liveness property is among the most important properties of programs. Many methodologies have been proposed for proving liveness properties. This paper studies deductive rules for proving liveness properties under different kinds of fairness requirements (constraints). It is based on method where a program is augmented by a non-constraining progress monitor based on a set of ranking functions, ...
متن کاملAuxiliary Constructs for Proving Liveness in Compassion Discrete Systems
For proving response properties for systems with compassion requirements, a deduction rule is introduced in [13]. In order to use the rule, auxiliary constructs are needed. They include helpful assertions and ranking functions defined on a well-founded domain. Along the line of the work [2] that computes ranking functions for response properties for systems with justice requirements, we develop...
متن کاملA Safety-strengthened Election Protocol Based on an Unreliable Failure Detector in Distributed Systems
A Leader is a Coordinator that supports a set of processes to cooperate a given task. This concept is used in several domains such as distributed systems, parallelism and cooperative support for cooperative work. In completely asynchronous systems, there is no solution for the election problem satisfying both of safety and liveness properties in asynchronous distributed systems. Therefore, to s...
متن کاملLiveness of Randomised Parameterised Systems under Arbitrary Schedulers
We consider the problem of verifying liveness for systems with a finite, but unbounded, number of processes, commonly known as parameterised systems. Typical examples of such systems include distributed protocols (e.g. for the dining philosopher problem). Unlike the case of verifying safety, proving liveness is still considered extremely challenging, especially in the presence of randomness in ...
متن کاملLiveness of Randomised Parameterised Systems under Arbitrary Schedulers (Technical Report)
We consider the problem of verifying liveness for systems with a finite, but unbounded, number of processes, commonly known as parameterised systems. Typical examples of such systems include distributed protocols (e.g. for the dining philosopher problem). Unlike the case of verifying safety, proving liveness is still considered extremely challenging, especially in the presence of randomness in ...
متن کامل